Approximating Subdense Instances of Covering Problems
نویسندگان
چکیده
منابع مشابه
Approximating Subdense Instances of Covering Problems
We study approximability of subdense instances of various covering problems on graphs, defined as instances in which the minimum or average degree is Ω(n/ψ(n)) for some function ψ(n) = ω(1) of the instance size. We design new approximation algorithms as well as new polynomial time approximation schemes (PTASs) for those problems and establish first approximation hardness results for them. Inter...
متن کاملApproximating dense cases of covering problems
We study dense instances of several covering problems An in stance of the set cover problem with m sets is dense if there is such that any element of the ground set X belongs to at least m sets We show that the dense set cover problem can be approximated with the performance ratio c log jX j for any c though it is unlikely to be NP hard A polynomial time approximation scheme is constructed for ...
متن کاملOn Approximating Four Covering and Packing Problems
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of them are generalized or specialized versions of set-cover and have applications in biology ranging from fullsibling reconstructions in wild populations to biomolecular clusterings; however, as this paper shows, their appr...
متن کاملApproximating Bounded Degree Instances of NP-Hard Problems
We present some of the recent results on computational complexity of approximating bounded degree combinatorial optimization problems. In particular, we present the best up to now known explicit nonapproximability bounds on the very small degree optimization problems which are of particular importance on the intermediate stages of proving approximation hardness of some other generic optimizatio...
متن کاملOn Approximating Four Covering/Packing Problems With Applications to Bioinformatics
In this paper, we consider approximability of four covering/packing type problems which have important applications in computational biology. The problems considered in this paper are the triangle packing problem, the full sibling reconstruction problem under two parsimonious assumptions, the maximum profit coverage problem and the 2-coverage problem. We provide approximation algorithms and ina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2011
ISSN: 1571-0653
DOI: 10.1016/j.endm.2011.05.051